منابع مشابه
On Nearly Linear Recurrence Sequences
A nearly linear recurrence sequence (nlrs) is a complex sequence (an) with the property that there exist complex numbers A0,. . ., Ad−1 such that the sequence ( an+d + Ad−1an+d−1 + · · · + A0an )∞ n=0 is bounded. We give an asymptotic Binet-type formula for such sequences. We compare (an) with a natural linear recurrence sequence (lrs) (ãn) associated with it and prove under certain assumptions...
متن کاملKingman's Subadditive Ergodic Theorem Kingman's Subadditive Ergodic Theorem
A simple proof of Kingman’s subadditive ergodic theorem is developed from a point of view which is conceptually algorithmic and which does not rely on either a maximal inequality or a combinatorial Riesz lemma.
متن کاملProgressions in Sequences of Nearly Consecutive Integers
For k > 2 and r ≥ 2, letG(k, r) denote the smallest positive integer g such that every increasing sequence of g integers {a1, a2, . . . , ag} with gaps aj+1 − aj ∈ {1, . . . , r}, 1 ≤ j ≤ g − 1 contains a k-term arithmetic progression. Brown and Hare [4] proved that G(k, 2) > √ (k − 1)/2( 43 ) (k−1)/2 and that G(k, 2s−1) > (sk−2/ek)(1+o(1)) for all s ≥ 2. Here we improve these bounds and prove ...
متن کاملNearly Disjoint Sequences in Convergence -groups
For an abelian lattice ordered group G let convG be the system of all compatible convergences on G; this system is a meet semilattice but in general it fails to be a lattice. Let αnd be the convergence on G which is generated by the set of all nearly disjoint sequences in G, and let α be any element of convG. In the present paper we prove that the join αnd ∨ α does exist in convG.
متن کاملLarge Period Nearly deBruijn FCSR Sequences ( Extended
Recently, a new class of feedback shift registers (FCSRs) was introduced, based on algebra over the 2-adic numbers. The sequences generated by these registers have many algebraic properties similar to those generated by linear feedback shift registers. However, it appears to be significantly more difficult to find maximal period FCSR sequences. Jn this paper we exhibit a tpchnique for easily fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica Hungarica
سال: 2020
ISSN: 0236-5294,1588-2632
DOI: 10.1007/s10474-020-01071-0